GLR TESTS FOR FAULT DETECTION OVER SLIDING DATA WINDOWS
نویسندگان
چکیده
منابع مشابه
Glr Tests for Fault Detection over Sliding Data Windows
The Generalized Likelihood Ratio (GLR) test for fault detection as derived by Willsky and Jones is a recursive method to detect additive changes in linear systems in a Kalman filter framework. Here, we evaluate the GLR test on a sliding window and compare it to stochastic parity space approaches. Robust fault detection defined as being insensitive to faults in the signal space is also studied i...
متن کاملGLR tests for fault detection over sliding data windows, Report no. LiTH-ISY-R-2635
The Generalized Likelihood Ratio (GLR) test for fault detection as derived by Willsky and Jones is a recursive method to detect additive changes in linear systems in a Kalman filter framework. Here, we evaluate the GLR test on a sliding window and compare it to stochastic parity space approaches. Robust fault detection defined as being insensitive to faults in the signal space is also studied i...
متن کاملQuerying Sliding Windows Over Online Data Streams
A data stream is a real-time, continuous, ordered sequence of items generated by sources such as sensor networks, Internet traffic flow, credit card transaction logs, and on-line financial tickers. Processing continuous queries over data streams introduces a number of research problems, one of which concerns evaluating queries over sliding windows defined on the inputs. In this paper, we descri...
متن کاملMining Frequent Itemsets for data streams over Weighted Sliding Windows
In this paper, we propose a new framework for data stream mining, called the weighted sliding window model. The proposed model allows the user to specify the number of windows for mining, the size of a window, and the weight for each window. Thus, users can specify a higher weight to a more significant data section, which will make the mining result closer to user’s requirements. Based on the w...
متن کاملQuerying languages over sliding windows
We study the space complexity of querying languages over data streams in the sliding window model. The algorithm has to answer at any point of time whether the content of the sliding window belongs to a fixed regular language. For regular languages, a trichotomy is shown: For every regular language the optimal space requirement is asymptotically either constant, logarithmic, or linear in the si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2005
ISSN: 1474-6670
DOI: 10.3182/20050703-6-cz-1902.00125